Method for interference rejection

ABSTRACT

The present invention relates to a method for identifying components in a telecommunication system, which method comprises representing a uniform linear array, ULA, antenna, having at least two antenna elements, by an array factor polynomial comprising at least two terms, each term having a certain weight (Wk); setting said weights (WK) to desired values such that a desired antenna radiation pattern is acquired. Furthermore, the method comprises the steps: changing the desired weights such that a number of sets of desired weights (Wk) is acquired, such that the ULA antenna scans a spatial portion, a certain scan corresponding to a certain set of desired weights, analyzing a received signal (h 0 ) being represented by a received array factor polynomial having terms with certain received weights, which is parameterized by at least one pole; and using each corresponding set of desired weights (Wk) and received weights to determine the pole parameterization.

TECHNICAL FIELD

The present invention relates to a method for identifying components in a telecommunication system, which method comprises the steps: representing a uniform linear array, ULA, antenna, having at least two antenna elements, by an array factor polynomial, the polynomial comprising at least two terms, each term having a certain weight and setting said weights to desired values such that a desired antenna radiation pattern corresponding to a desired array factor polynomial is acquired for the ULA antenna.

BACKGROUND

In telecommunication, one or more base station communicates with mobile stations such as mobile phones and laptops. Typically, a mobile station is modelled by a so-called cluster of local scatterers. This cluster is a collection of scatterers which are close to the transmitting mobile station, where the term “close” shall be interpreted as a distance which corresponds to a time which is much smaller than the symbol time. The scatterers constituting a cluster will, as their numbers grow, create a signal distribution, here termed azimuth spread.

A receiving base station will receive signals from scatterers, producing angular dependent distributions of signals. Typically, such a distribution is termed Power Azimuth Spread (PAS). A specific direction may, for example, be comprised of disturbing signals, producing an angular dependent distribution of the transmitted signals.

This results in a general problem with interference in a wireless multi-user communication system. The interference often limits the capacity of the system. There exists several well-known ways to handle interference, for example by using beam-forming.

However, beam-forming is mainly dealing with focusing a gain function in a certain direction. This function is derived subject to a direction, in which some desired signal is presumed to be. An interfering signal may lay in a close neighborhood (azimuth) to the desired signal, causing problems.

There is thus a need for reducing such interference without the disadvantages of prior art solutions. To achieve this, a simple and effective way to analyze the channel is needed.

SUMMARY

The object of the present invention is to disclose a simple and effective method for analyzing a channel in a telecommunication system, which in turn makes it possible to reduce interference, for example due to other transmitters.

This object is solved by a method as mentioned initially. Furthermore, the method comprises the steps: changing the desired weights such that a number of sets of desired weights is acquired, such that the ULA antenna scans a spatial portion, a certain scan corresponding to a certain set of desired weights, and the number of scans at least being equal to the number of antenna elements in the ULA antenna; analyzing a received signal obtained from said scans, the received signal being represented by a received array factor polynomial comprising at least two terms, each term having a certain received weight, such that a received set of weights is acquired, the received set of weights being constituted by the desired set of weights scaled and rotated, the received array factor polynomial further being parameterized by at least one pole; and using each corresponding set of desired weights and received weights to determine the pole parameterization.

According to a preferred embodiment, the desired array factor polynomial is parameterized by at least two zeroes, where at least one zero is used for cancelling out a pole by altering the desired weights such that said zero is moved to said pole.

Preferably, each pole corresponds to a disturbance enabling each disturbance to be cancelled out by cancelling out its corresponding pole.

According to another preferred embodiment, the expression for the received signal in the spatial domain is derived by means of a least square method or a Fourier transform.

A number of advantages are acquired by means of the present invention. For example, a simple and effective method for analyzing a channel in a telecommunication system is obtained.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will now be described more in detail with reference to the appended drawings, where

FIG. 1 shows a base station in a cluster;

FIG. 2 shows a plot of an azimuth plane;

FIG. 3 shows a plot of a first set of antenna diagrams;

FIG. 4 shows a plot of a second set of antenna diagrams; and

FIG. 5 shows a flow-chart describing a preferred set of method step for carrying out the present invention.

DETAILED DESCRIPTION

Generally, an alternative model for a disturbing signal from a scatterer is a source of power in the angular spectra. The source can be modelled by introducing a pole model in the angular domain. An antenna array can from a system function perspective be represented by zeros in a complex plane. Likewise, a pole can be inserted in that plane. This means that for a single pole, the angle with respect to the real axis defines the direction and the distance from the origin defines the spread. Inherent in the pole model lays the fact that it represents a cluster with infinitely many scatterers, yet modelled by one parameter.

A description of an embodiment of the present invention will now be given more in detail, with reference to FIG. 1.

In a certain area, there is a first base station 1 and a second base station 2. The base stations 1, 2 are arranged to communicate with mobile stations 3, 4. The first base station 1 and the second bas station comprise a uniform linear array, ULA, antenna 5, 6, respectively. Each antenna 5, 6 comprises a number of linearly arranged antenna elements 7, 8 having an upper side and a lower side, where a ground plane is placed below the antenna elements' lower side.

The first base station 1 experiences disturbances, both mobile and non-mobile disturbances, where the second base station 2 constitutes a non-mobile disturbance.

Practically, each element in first base station's ULA antenna 5 is fed directly from a respective radio chain, being arranged for both transmission and reception. By delaying signals and giving them certain amplitudes, the ULA antenna 5 is electrically controlled. In a model, the ULA antenna's array factor H can be written as:

$\begin{matrix} \begin{matrix} {H = {\sum\limits_{k = 0}^{K - 1}\left( {w_{k}{\mathbb{e}}^{\frac{{j2\pi}\;{dk}}{\lambda}\cos\;\theta}} \right)}} \\ {= \left\{ {z = {\mathbb{e}}^{\frac{{j2\pi}\;{dk}}{\lambda}\cos\;\theta}} \right\}} \\ {= {\sum\limits_{k = 0}^{K - 1}\left( {w_{k}z^{k}} \right)}} \\ {= {{w_{K - 1}z^{K - 1}} + \ldots + {w_{1}z} + w_{0}}} \end{matrix} & (1) \end{matrix}$ where d is the spacing between the antenna elements in the ULA antenna, λ is the present wavelength, θ is the present angle in azimuth around the horizontally arranged ULA antenna, w_(k) is each a weight for each antenna element, defining its electrical control, and K is the number of antenna elements in the ULA antenna.

In equation (1), the term cos θ can be substituted be a more general function trig θ, where trig θ is a trigonometric function of θ that depends on the coordinate system used when setting the weights w_(k).

The array factor H can be written as a product of sums according to H=(z−z ₀)(z−z ₁) . . . (z−z _(K−1)),  (2) which corresponds to that the array factor H has a number of nulls z₀, z₁, . . . z_(K−1), where each null corresponds to a low degree of coverage in the azimuth direction corresponding to that null.

If the array factor H is written as a spatial function by means of inverse z-transformation, we obtain an impulse function h(n) according to:

$\begin{matrix} {{{h(n)} = {\sum\limits_{k = 0}^{K - 1}\left( {w_{k}{\delta\left( {n - k} \right)}} \right)}},} & (3) \end{matrix}$ where n is a spatial variable and δ(n−k)=1 for n=k, otherwise δ(n−k)=0.

Hence h(0)=w₀; h(1)=w₁ etc.

By setting the weights w_(k) properly, a desired antenna radiation pattern is acquired for a certain set of weights w_(K−1) . . . w₀.

According to the present invention, the ULA antenna 5 is scanned in a spatial region, preferably in azimuth from −90° to 90°, where the normal to the antenna elements' upper side extends in the azimuth direction 0°, since the surroundings behind the antenna's ground plane is of lesser interest. The scanning comprises a number of scans and takes place by changing the set of weights w_(K−1) . . . w₀ in such a way that the desired antenna radiation pattern is rotated around the ULA antenna 5 in the azimuth plane. For each scan, a certain set of weights is used, and for each set of weights the ideal, desired, antenna radiation pattern is known. One way of achieving this is to use the weights w_(k)=e^(jkβ), where β is the pointing direction.

The scanning takes place in reception, i.e. the ULA antenna 5 is used as a receiving antenna, and for each scan, e.g. a new value for β, a complex received result is obtained. A collection of complex received results generates a complex curve termed a total received result. The total received result is compared with the theoretical antenna diagram. Based on a comparison, disturbances may be determined.

By determining a disturbance, in a preferred aspect of the present invention, it may more or less be cancelled out by changing the set of weights such that for the position of each detected disturbance, a null of the ULA antenna is positioned there. Hence, the maximum number of disturbances that may be cancelled in this way equals the number of elements minus one.

The procedure according to the present invention will now be disclosed more in detail.

The ULA antenna 5 scans a certain spatial region. Azimuthal scanning implies that the ULA antenna's antenna diagram is convolved with the angular spectrum of the channel. Transforming the problem to the spatial domain means that an observed spatial impulse response is acquired.

A disturbance may be modelled as an infinite array antenna. In an embodiment example, the disturbing second base station 2 may be represented by a spatial disturbance expression h _(c)(n)=c ^(n) , cε

  (4)

The received signal is referred to as an observed signal h_(o)(n). Provided that the disturbance has an angular spread, in the spatial domain, the observed signal h_(o)(n) is regarded as a multiplication between the array factor

${h(n)} = {\sum\limits_{k = 0}^{K - 1}\left( {w_{k}{\delta\left( {n - k} \right)}} \right)}$ and the disturbance h_(c)(n)=c^(n). In the angular domain, this means that the antenna diagram is convolved with the angular spectrum of the disturbance, which has a smearing effect on the original antenna diagram.

Here, in the spatial domain, for a certain antenna diagram having a certain known appearance and pointing angle for its main beam due to the setting of the weights w_(k), the expression for the total observed, received, signal h_(o)(n) is:

$\begin{matrix} \begin{matrix} {{h_{o}(n)} = {\sum\limits_{k = 0}^{K - 1}{\left( {w_{k}{\delta\left( {n - k} \right)}} \right){h_{c}(k)}}}} \\ {= {\sum\limits_{k = 0}^{K - 1}\left( {w_{k}c^{k}{\delta\left( {n - k} \right)}} \right)}} \\ {= {\sum\limits_{k = 0}^{K - 1}{\left( {{w_{k}\left( {{c}{\mathbb{e}}^{{j\arg}\; c}} \right)}^{k}{\delta\left( {n - k} \right)}} \right).}}} \end{matrix} & (5) \end{matrix}$

When h_(o)(n) is transformed into the z-plane, the corresponding signal H_(o)(z) is written as

$\begin{matrix} \begin{matrix} {{H_{o}(z)} = {\sum\limits_{k = 0}^{K - 1}\left( {{w_{k}\left( {{c}{\mathbb{e}}^{{j\arg}\; c}} \right)}^{k}z^{k}} \right)}} \\ {\sum\limits_{k = 0}^{K - 1}\left( {w_{k}\left( {{c}{\mathbb{e}}^{{j\arg}\; c}z} \right)}^{k}\Rightarrow{H_{o}\left( \overset{\sim}{z} \right)} \right.} \\ {{\sum\limits_{k = 0}^{K - 1}\left( {w_{k}{\overset{\sim}{z}}^{k}} \right)},} \end{matrix} & (6) \end{matrix}$ where {tilde over (z)}=|c|e^(jargc)z and z is a complex variable of the angular domain.

The expression H_(o)({tilde over (z)}) comprises the factors w_(k) which are scaled by |c| and rotated by arg c. |c| relates to the width of the disturbance, and arg c corresponds to the azimuth direction to the disturbance. In order to find these parameters, c will be calculated. The described method is one of many possible system identification methods and serves as an example.

The expression in equation (5) relates to one single pole. Generally the number of poles for which the present invention is applicable is L, where L≦K−2. Thus a general expression for the poles is

${\sum\limits_{l = 0}^{L}C_{l}^{k}},$ where L≦K−2. Inserting this general expression into equation (5) results in a more general equation for the total observed, received, signal h_(o)(n) in the spatial domain:

$\begin{matrix} \begin{matrix} {{h_{o}(n)} = {\sum\limits_{k = 0}^{K - 1}\left( {{w_{k}\left\lbrack {\sum\limits_{l = 0}^{L}c_{l}^{k}} \right\rbrack}{\delta\left( {n - k} \right)}} \right)}} \\ {{= {\sum\limits_{k = 0}^{K - 1}\left( {{w_{k}\left\lbrack {\sum\limits_{k = 0}^{K - 1}\left( {{c_{l}}{\mathbb{e}}^{{j\arg}\; c_{l}}} \right)^{k}} \right\rbrack}{\delta\left( {n - k} \right)}} \right)}},} \end{matrix} & (7) \end{matrix}$ where L≦K−2.

In the following, an example where one pole is present is discussed. In order to use equation (5) for determining h_(o), a number of observations are inserted. h _(o)(0)=w ₀ c ⁰ =w ₀ h _(o)(1)=w ₁ c ¹ Division yields

$\begin{matrix} {\frac{h_{0}(0)}{h_{0}(1)} = {\left. \frac{w_{0}}{w_{1}c}\Rightarrow c \right. = \frac{w_{0}{h_{0}(1)}}{w_{1}{h_{0}(0)}}}} & (8) \end{matrix}$ where all terms on the right side are known. Given a known pointing direction, β, and, for example, w_(k)=e^(jkβ), it follows from insertion that the angle of c is relative to the pointing direction.

In the same way, for two following observations, a corresponding division yields

$\begin{matrix} {\frac{h_{0}(1)}{h_{0}(2)} = {\left. \frac{w_{1}c}{w_{2}c^{2}}\Rightarrow c \right. = {\frac{w_{1}{h_{0}(2)}}{w_{2}{h_{0}(1)}}.}}} & (9) \end{matrix}$

The theoretical terms h₀(k) normally contains a certain amount of noise. This means that the calculated value of c, being dependent of observed terms {tilde over (h)}₀(k) will vary with the noise. In order to calculate c more accurately, a maximum likelihood estimation is preferable performed. Assuming that the noise is white Gaussian noise, the following expression may be used:

$\begin{matrix} {\frac{\partial{L(c)}}{\partial c} = {\sum\limits_{k = 0}^{K - 1}{{kc}^{k - 1}\left( {{{\overset{\sim}{h}}_{0}(k)} - c^{k}} \right)}}} & (10) \end{matrix}$

Here, the function L is a log likelihood function. Clearly this equation is non-linear, and one way to solve it is by means of a Newton search.

In FIG. 2 and FIG. 3, the effect a disturbance has on the ideal antenna diagram is shown graphically. FIG. 2 depicts the azimuth plane where the ideal ULA is represented by its zeros indicated by the symbol ∘. In FIG. 3, a corresponding antenna diagram is shown as a dotted curve 9. This curve 9 corresponds to the ideal array factor according to equation (1).

A disturbance, modeled as a pole, is shown in FIG. 2 as a x mark and the corresponding angular spectrum is the dashed curve 10 in FIG. 3. The disturbance corresponds to the expression in equation (4).

When a scanning in azimuth is performed, as described in the spatial domain with the impulse function in equation (5) above, this results in an angular spectrum shown by the solid curve 11 in FIG. 3, i.e. it is a total observed, received, signal. This spectrum corresponds to the array zeros shown in FIG. 2 with the symbol +. The resulting configuration of zeroes, corresponding to the total observed, received, signal 11, is a contraction of the original configuration.

According to a preferred aspect of the present invention, generally, since the antenna 5 is represented by a set of zeros, one or some of the zeros can be moved to cancel one or many poles. In other words, placing a zero on every pole which originates from the second disturbing base station 2 eliminates the effect of that disturbing base station 2. The information needed is derived from one or many complex numbers as c, which is derived for the case of one disturbing PAS according to the above, see equations (7) and (8).

By means of z-transform, equation (4) can be written as

$\begin{matrix} {{{H_{c}(z)} = \frac{1}{1 + {cz}^{- 1}}},} & (11) \end{matrix}$ and when c is known, equation (1) may be written as H(z)=(1+cz ⁻¹)({tilde over (w)} _(K−2) z ^(−K+2) + . . . +{tilde over (w)} ₀).  (12)

This means that for the observed, received, signal, the following expression corresponding to equation (6) may be written:

$\begin{matrix} \begin{matrix} {{H_{o}(z)} = \frac{\left( {1 + {cz}^{- 1}} \right)\left( {{{\overset{\sim}{w}}_{K - 2}z^{{- K} + 2}} + \ldots + {\overset{\sim}{w}}_{0}} \right)}{\left( {1 + {cz}^{- 1}} \right)}} \\ {= \left( {{{\overset{\sim}{w}}_{K - 2}z^{{- K} + 2}} + \ldots + {\overset{\sim}{w}}_{0}} \right)} \end{matrix} & (13) \end{matrix}$

Here, the last term on the right-hand side of equation (11) relates to the resulting antenna radiation pattern when one zero has been used to cancel out one pole.

Since each zero cancelling a pole can be regarded as lost, the remaining zeroes constitute the basis for the antenna diagram. Using the example illustrated in FIG. 2 and FIG. 3, the resulting antenna diagram is shown in FIG. 5. Here, the ideal, desired, antenna diagram is shown with a dotted curve 12, and the observed, received signal is shown with a dashed curve 13. This dashed curve 13 corresponds to the solid curve 11 in FIG. 3. The appearance of the resulting antenna diagram after that the disturbance has been eliminated according to the method above is shown with a solid curve 14.

As apparent from FIG. 4, the ideal antenna diagram 12 deviates from the resulting antenna diagram, since one of the zeroes has been removed, the resulting antenna diagram 14 will deviate from the ideal antenna diagram 12. The deviation is manifested by a bias in main beam pointing direction; the resulting antenna diagram 14 has a main beam pointing angle of a lower value than the ideal antenna diagram 12.

In FIG. 4 a flowchart for interference cancellation method is outlined.

15: First, disturbing signals, manifested by clusters, are identified using a pole model.

16: Then, with reference to FIG. 2, distances d between zeroes and poles are calculated. The reason for this is that the zero closest to a pole in question shall be used to cancel, which actually is carried out in step 17 below.

17: A match function V(x) is minimized for each cluster to cancel. The match function V(x) produces as a result which zeroes that are closest to the poles in question. Thus zeroes and poles are matched according to the match function V(x). More specifically, for a certain pole, the match function V(x) will produce different values of the distance d for different zeroes. The zero corresponding to the distance d having the smallest magnitude is chosen. Here, x denotes a vector comprising zeroes and poles.

18: Then the new zeroes are used to compute new array weights.

19: Finally, the new array weights are used to cancel the undesired disturbers, being manifested by clusters.

The present invention is not limited to the embodiments above, but may vary freely within the scope of the appended claims. For example, the cluster comprising disturbing signals may comprise any sources, where any cluster is a collection of scatterers which are close to the transmitting mobile station, where the term “close” shall be interpreted as a distance which corresponds to a time which is much smaller than the symbol time.

There base stations used may be of any suitable kind, and may comprise several ULA antennas each, such that certain sectors are covered by the ULA antennas.

The ULA antennas may be of any suitable kind, for example patch antennas, slot antennas, slot fed patches or dipole antennas.

Equation (5) may be derived by means of a least squares method or a Fourier transform. 

1. A method for identifying components in a telecommunication system, which method comprises the steps: representing a uniform linear array, ULA, antenna, having at least two antenna elements, by an array factor polynomial, the polynomial comprising at least two terms, each term having a certain weight (w_(k)); setting said weights (w_(k)) to desired values such that a desired antenna radiation pattern corresponding to a desired array factor polynomial is acquired for the ULA antenna; wherein the method comprises the steps: changing the desired weights such that a number of sets of desired weights (w_(k)) is acquired, such that the ULA antenna scans a spatial portion, a certain scan corresponding to a certain set of desired weights, and the number of scans at least being equal to the number of antenna elements in the ULA antenna; analyzing a received signal (h₀) obtained from said scans, the received signal (h₀) being represented by a received array factor polynomial comprising at least two terms, each term having a certain received weight, such that a received set of weights is acquired, the received set of weights being constituted by the desired set of weights (w_(k)) scaled and rotated, the received array factor polynomial further being parameterized by at least one pole; and using each corresponding set of desired weights (w_(k)) and received weights to determine the pole parameterization.
 2. A method according to claim 1, wherein the desired array factor polynomial is parameterized by at least two zeroes, where at least one zero is used for cancelling out a pole by altering the desired weights (w_(k)) such that said zero is moved to said pole.
 3. A method according to claim 2, wherein a pole cancellation procedure comprises the following steps: identifying poles in a pole model; calculating distances (d) between zeroes and poles; minimizing a match function (V(x)) for each pole cancellation, the match function (V(x)) producing as a result which zeroes that are closest to the poles in question, allowing zeroes and poles to be matched according to the match function (V(x)), meaning that for a certain pole, the match function (V(x)) will produce different values of the distance (d) for different zeroes, and the zero corresponding to the distance (d) having the smallest magnitude is chosen; using the new zeroes to compute new array weights; and using the new array weights to cancel the poles in question.
 4. A method according to claim 2 wherein each pole corresponds to a disturbance enabling each disturbance to be cancelled out by cancelling out its corresponding pole.
 5. A method according to claim 4, wherein the received signal (h₀(n)) in the spatial domain may be written as $\begin{matrix} {{h_{o}(n)} = {\sum\limits_{k = 0}^{K - 1}\left( {{w_{k}\left\lbrack {\sum\limits_{l = 0}^{L}c_{l}^{k}} \right\rbrack}{\delta\left( {n - k} \right)}} \right)}} \\ {= {\sum\limits_{k = 0}^{K - 1}\left( {{w_{k}\left\lbrack {\sum\limits_{l = 0}^{L}\left( {{c_{l}}{\mathbb{e}}^{{j\arg}\; c_{l}}} \right)^{k}} \right\rbrack}{\delta\left( {n - k} \right)}} \right)}} \end{matrix}$ where each c_(l) is a complex value corresponding to a certain pole, where |c_(l)| relates to the width of the disturbance and arg c_(l) corresponds to the relative azimuth direction to the disturbance, and where n is a spatial variable, δ(n−k)=1 for n=k, otherwise δ(n−k)=0, K is the number of antenna elements in the ULA antenna and L is an integer satisfying L≦K−2.
 6. A method according to claim 5, wherein the expression for the received signal (h₀(n)) in the spatial domain is derived by means of a least squares method or a Fourier transform.
 7. A method according to claim 5, wherein in order to determine the pole parameterization, each complex value (c_(l)) is calculated using a maximum likelihood estimation. 